Any 2-asummable bipartite function is weighted threshold
نویسندگان
چکیده
منابع مشابه
compactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولConfidence-Weighted Bipartite Ranking
Bipartite ranking is a fundamental machine learning and data mining problem. It commonly concerns the maximization of the AUC metric. Recently, a number of studies have proposed online bipartite ranking algorithms to learn from massive streams of class-imbalanced data. These methods suggest both linear and kernel-based bipartite ranking algorithms based on first and second-order online learning...
متن کاملDiverse Weighted Bipartite b-Matching
Bipartite matching, where agents on one side of a market are matched to agents or items on the other, is a classical problem in computer science and economics, with widespread application in healthcare, education, advertising, and general resource allocation. A practitioner’s goal is typically to maximize a matching market’s economic efficiency, possibly subject to some fairness requirements th...
متن کاملOn Weighted Bipartite Edge Coloring
We study weighted bipartite edge coloring problem, which is a generalization of two classical problems: bin packing and edge coloring. This problem has been inspired from the study of Clos networks in multirate switching environment in communication networks. In weighted bipartite edge coloring problem, we are given an edge-weighted bipartite multigraph G = (V,E) with weights w : E → [0, 1]. Th...
متن کاملThreshold Functions for the Bipartite Tura'n property
Let G2(n) denote a bipartite graph with n vertices in each color class, and let z(n, t) be the bipartite Turán number, representing the maximum possible number of edges in G2(n) if it does not contain a copy of the complete bipartite subgraph K(t, t). It is then clear that ζ(n, t) = n2− z(n, t) denotes the minimum number of zeros in an n×n zero-one matrix that does not contain a t × t submatrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.01.023